BDDNOW: A Parallel BDD Package
نویسندگان
چکیده
BDDs (binary decision diagrams) are ubiquitous in formal verificationtools, and the time and memory used by the BDD package is frequently the con-straint that prevents application of formal verification. Accordingly, several re-searchers have investigated using parallel processing for BDDs. In this paper, wepresent a parallel BDD package with several novel features. The parallelizationscheme strives for minimal communication overhead, so we are able to demon-strate speed-up even running on networked commodity PC workstations. Averagememory utilization per node is comparable to that of efficient sequential pack-ages. In addition, the package supports dynamic variable reordering, and simulta-neous computation of multiple BDD operations. Finally, the package is designedfor portability – providing a subsetof the CUDD API for the application program-mer, and running on the widely available PVM package.
منابع مشابه
A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking
Symbolic data structures using Binary Decision Diagrams (BDDs) have been successfully used in the last decades to analyse large systems. While various BDD and MTBDD packages have been developed in the community, the CUDD package remains the default choice of most of the symbolic (probabilistic) model checkers. In this paper, we provide the first comparative study of the performance of various B...
متن کاملMulti-Core BDD Operations for Symbolic Reachability
This paper presents scalable parallel BDD operations for modern multi-core hardware. We aim at increasing the performance of reachability analysis in the context of model checking. Existing approaches focus on performing multiple independent BDD operations rather than parallelizing the BDD operations themselves. In the past, attempts at parallelizing BDD operations have been unsuccessful due to...
متن کاملCacBDD: A BDD Package with Dynamic Cache Management
In this paper, we present CacBDD, a new efficient BDD (Binary Decision Diagrams) package. It implements a dynamic cache management algorithm, which takes account of the hit-rate of computed table and available memory. Experiments on the BDD benchmarks of both combinational circuits and model checking show that CacBDD is more efficient compared with the state-of-the-art BDD package CUDD.
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کامل